Path following algorithm application to automatic berthing control
نویسندگان
چکیده
منابع مشابه
Consistently Trained Artificial Neural Network for Automatic Ship Berthing Control
In this paper, consistently trained Artificial Neural Network controller for automatic ship berthing is discussed. Minimum time course changing manoeuvre is utilised to ensure such consistency and a new concept named ‘virtual window’ is introduced. Such consistent teaching data are then used to train two separate multi‐layered feed forward neural networks for com...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملAn Effective Ship Berthing Algorithm
Singapore has one of the busiest ports in the world. Ship berthing is one of the problems faced by the planners at the port. In this paper , we study the ship berthing problem. We first provide the problem formulation and study the complexity of the problem with different restrictions. In general, the ship berthing problem is NP-complete, although, some of its variants may be solved quickly. Wh...
متن کاملBackward and forward path following control of a wheeled robot
A wheeled mobile robot is one of the most important types of mobile robots. A subcategory of these robots is wheeled robots towing trailer(s). Motion control problem, especially in backward motion is one of the challenging research topics in this field. In this article, a control algorithm for path-following problem of a tractor-trailer system is provided, which at the same time provides the ab...
متن کاملAccelerated Path-following Iterative Shrinkage Thresholding Algorithm with Application to Semiparametric Graph Estimation.
We propose an accelerated path-following iterative shrinkage thresholding algorithm (APISTA) for solving high dimensional sparse nonconvex learning problems. The main difference between APISTA and the path-following iterative shrinkage thresholding algorithm (PISTA) is that APISTA exploits an additional coordinate descent subroutine to boost the computational performance. Such a modification, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Marine Science and Technology
سال: 2020
ISSN: 0948-4280,1437-8213
DOI: 10.1007/s00773-020-00758-x